منابع مشابه
Fusion systems for profinite groups
We introduce the notion of a pro-fusion system on a pro-p group, which generalizes the notion of a fusion system on a finite p-group. We also prove a version of Alperin’s Fusion Theorem for pro-fusion systems.
متن کاملProfinite Monads, Profinite Equations, and Reiterman's Theorem
Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman’s theorem states that they precisely specify pseudovarieties, i.e. classes of finite algebras closed under finite products, subalgebras and quotients. In this paper Reiterman’s theorem is generalised to finite Eilenberg-Moore algebras for a monad T on a variety D of (ordered) algebras: ...
متن کاملProfinite semigroups
We present a survey of results on profinite semigroups and their link with symbolic dynamics. We develop a series of results, mostly due to Almeida and Costa and we also include some original results on the Schützenberger groups associated to a uniformly recurrent set.
متن کاملProfinite Groups
γ = c0 + c1p+ c2p + · · · = (. . . c3c2c1c0)p, with ci ∈ Z, 0 ≤ ci ≤ p− 1, called the digits of γ. This ring has a topology given by a restriction of the product topology—we will see this below. The ring Zp can be viewed as Z/pZ for an ‘infinitely high’ power n. This is a useful idea, for example, in the study of Diophantine equations: if such an equation has a solution in the integers, then it...
متن کاملProfinite automata
Many sequences of p-adic integers project modulo p to p-automatic sequences for every α ≥ 0. Examples include algebraic sequences of integers, which satisfy this property for every prime p, and some cocycle sequences, which we show satisfy this property for a fixed p. For such a sequence, we construct a profinite automaton that projects modulo p to the automaton generating the projected sequenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 2019
ISSN: 0167-8094,1572-9273
DOI: 10.1007/s11083-019-09499-y